Lower boundary independent broadcasts in trees
نویسندگان
چکیده
منابع مشابه
Reconstructing Broadcasts on Trees
Given a branching Markov process on a tree, the goal of the reconstruction (or “broadcast”) problem is to guess the initial condition at the root, given the states of the leaves. In this essay, we evaluate the performance of some algorithms, new and old, for solving the reconstruction problem.
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملBroadcasts in graphs
We say that a function f : V → {0, 1, . . . , diam(G)} is a broadcast if for every vertex v ∈ V , f(v) ≤ e(v), where diam(G) denotes the diameter of G and e(v) denotes the eccentricity of v. The cost of a broadcast is the value f(V ) = Σv∈V f(v). In this paper we introduce and study the minimum and maximum costs of several types of broadcasts in graphs, including dominating, independent and eff...
متن کاملFinding Four Independent Trees
Motivated by a multi-tree approach to the design of reliable communication protocols, Itai and Rodeh gave a linear time algorithm for finding two independent spanning trees in a 2-connected graph. Cheriyan and Maheshwari gave an O(|V |) algorithm for finding three independent spanning trees in a 3-connected graph. In this paper we present an O(|V |) algorithm for finding four independent spanni...
متن کاملA lower bound for the vertex boundary-width of complete k-ary trees
The vertex boundary-width problem (for short VBWP) is to determine the value of vbw(G)=max1 |V |minS⊆V,|S|= |N(S)| for a given graph G= (V ,E), where N(S)= {v / ∈ S|v is a neighbor of u for some u ∈ S}. In this paper, we give a lower bound for vertex boundary-width of complete k-ary trees. © 2007 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: ['1234-3099', '2083-5892']
DOI: https://doi.org/10.7151/dmgt.2434